用栈和队列实现简单的停车场管理系统

Parking.h:

#include <stdio.h>
#include <time.h>
#include <string.h>
#include <stdlib.h>

#define N 1

typedef struct car
{
    char * timer;
}CAR;

typedef struct que
{
    int flt;
    struct que *next;
}QUE;

void pushp();
char *popp();
void push(char *);
void popg();
void enterque();
void outque();
void mytime(char *,char *);

Parking.h:

#include "Parking.h"

CAR parking[10];
CAR giveway[10];
int per = N;
int topp = -1;
int topg = -1;
QUE *front = NULL;
QUE *rear = NULL;

void enterque()
{
    QUE *newnode = (QUE *)malloc(sizeof(QUE));
    if(rear == NULL)
    {
	newnode->flt = 1;
	front = newnode;
	rear = newnode;
	rear->next = NULL;
    }
    else
    {
        newnode->flt = 1;
	rear = newnode;
	rear->next = NULL;
    }
}

void outque()
{
    if(front == NULL)
    {
        printf("没有人在等待!\n");
    }
    else
    {

        QUE *tmp = front;
	front->flt = 0;
	front = front->next;
	free(tmp);
	tmp = NULL;
    }
}

void pushp()
{
    if(topp == 9)
    {
        printf("停车位已满，请等待！\n");
    }
    else
    {
        topp++;
        time_t timer = time(NULL);
	parking[topp].timer = (char *)malloc(30);
	strcpy(parking[topp].timer,ctime(&timer));
    }
}

char * popp()
{
    char *str = (char *)malloc(30);
    if(topp == -1)
    {
        printf("停车位为空！\n");
    }
    else
    {
        strcpy(str,parking[t